Shortest Path Problems in Fuzzy Network

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...

متن کامل

Fuzzy Shortest-Path Network Problems With Uncertain Edge Weights

This paper presents two new types of fuzzy shortest-path network problems. We consider the edge weight of the network as uncertain, which means that it is either imprecise or unknown. Thus, the first type of fuzzy shortest-path problem uses triangular fuzzy numbers for the imprecise problem. The second type uses level (1 − β, 1 − α) interval-valued fuzzy numbers, which are based on past statist...

متن کامل

algorithms for biobjective shortest path problems in fuzzy networks

we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...

متن کامل

Shortest Path Problem on Intuitionistic Fuzzy Network

Received 17September 2013; accepted 5 October2013 L Baba Abstract. Finding shortest paths in graphs has been the area of interest for many researchers. Shortest paths are one of the fundamental and most widely used concepts in networks. In this paper the authors present an algorithm to find an Intuitionistic Fuzzy Shortest Path (IFSP) in a directed graph in which the cost of every edges are rep...

متن کامل

Robust shortest path problems

This paper is a state of the art on the shortest path problems for which it exists uncertainty and inaccuracy factors on arc values. Two uncertainty models are distinguished: the so-called interval model and the discrete set of scenarios model. Different measures and approaches of robustness are presented: those coming from decision theory, those coming from multicriteria analysis and those com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Systems

سال: 1998

ISSN: 0915-647X,2432-9932

DOI: 10.3156/jfuzzy.10.2_168